Sensitivity of Constrained Markov Decision Processes

We consider the optimization of nite-state, nite-action Markov Decision processes, under constraints. Costs and constraints are of the discounted or average type, and possibly nite-horizon. We investigate the sensitivity of the optimal cost and optimal policy to changes in various parameters. We relate several optimization problems to a generic Linear Program, through which we investigate sensitivity issues. We establish conditions for the continuity of the optimal value in the discount factor. In particular, the optimal value and optimal policy for the expected average cost are obtained as limits of the discounted case, as the discount factor goes to one. This generalizes a well-known result for the unconstrained case. We also establish the continuity in the discount factor for certain non-stationary policies. We then discuss the sensitivity of optimal policies and optimal values to small changes in the transition matrix and in the instantaneous cost functions. The importance of the last two results is related to the performance of adaptive policies for constrained MDP under various cost criteria 3, 5]. Finally, we establish the convergence of the optimal value for the discounted constrained nite horizon problem to the optimal value of the corresponding innnite horizon problem.